A fast segmentation algorithm for piecewise polynomial numeric function generators
نویسندگان
چکیده
We give an efficient algorithm for partitioning the domain of a numeric function f into segments. The function f is realized as a polynomial in each segment, and a lookup table stores the coefficients of the polynomial. Such an algorithm is an essential part of the design of lookup table methods [5,8,9,12,14,15] for realizing numeric functions, such as sin(πx), ln(x), and √ −ln(x). Our algorithm requires many fewer steps than a previous algorithm given in [6] and makes tractable the design of numeric function generators based on table lookup for high-accuracy applications. We show that an estimate of segment width based on local derivatives greatly reduces the search needed to determine the exact segment width. We apply the new algorithm to a suite of 15 numeric functions and show that the estimates are sufficiently accurate to produce a minimum or near-minimum number of computational steps.
منابع مشابه
Design Method for Numerical Function Generators Using Recursive Segmentation and EVBDDs
Numerical function generators (NFGs) realize arithmetic functions, such as ex, sin(πx), and √ x, in hardware. They are used in applications where high-speed is essential, such as in digital signal or graphics applications. We introduce the edge-valued binary decision diagram (EVBDD) as a means of reducing the delay and memory requirements in NFGs. We also introduce a recursive segmentation algo...
متن کاملPiecewise Arithmetic Expressions of Numeric Functions and Their Application to Design of Numeric Function Generators
In this paper, we propose a new representation of numeric functions using a piecewise arithmetic expression. To represent a numeric function compactly, we partition the domain of the function into uniform segments, and transform the sub-function in each segment into an arithmetic spectrum. From this arithmetic spectrum, we derive an arithmetic expression, and obtain a piecewise arithmetic expre...
متن کاملProgrammable Architectures and Design Methods for Two-Variable Numeric Function Generators
This paper proposes programmable architectures and design methods for numeric function generators (NFGs) of two-variable functions. To realize a twovariable function in hardware, we partition a given domain of the function into segments, and approximate the function by a polynomial in each segment. This paper introduces two planar segmentation algorithms that efficiently partition a domain of a...
متن کاملPiecewise arithmetic expressions of numeric functions and their applicatio to design of numeric function generators
متن کامل
Programmable Architectures and Design Methods for Two - Variable Numeric Function
This paper proposes programmable architectures and design methods for numeric function generators (NFGs) of two-variable functions. To realize a twovariable function in hardware, we partition a given domain of the function into segments, and approximate the function by a polynomial in each segment. This paper introduces two planar segmentation algorithms that efficiently partition a domain of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Computational Applied Mathematics
دوره 235 شماره
صفحات -
تاریخ انتشار 2011